Additive problems with almost prime squares
نویسندگان
چکیده
Abstract We show that every sufficiently large integer is a sum of prime and two almost squares, also smooth number squares. The such representations the expected order magnitude. likewise treat shifted primes $$p-1$$ p - 1 as sums methods involve combination analytic, automorphic algebraic arguments to handle by restricted binary quadratic forms with high degree uniformity.
منابع مشابه
Sums of almost equal prime squares
In this short note, we prove that almost all integers N satisfying N ≡ 3 (mod 24) and 5 -N or N ≡ 4 (mod 24) is the sum of three or four almost equal prime squares, respectively: N = p21 + · · ·+ p 2 j with |pi − (N/j) 1/2| ≤ N1/2−9/80+ε for j = 3 or 4 and 1 ≤ i ≤ j.
متن کاملOn generalisations of almost prime and weakly prime ideals
Let $R$ be a commutative ring with identity. A proper ideal $P$ of $R$ is a $(n-1,n)$-$Phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin R$, $a_1cdots a_nin Pbackslash P^m$ ($a_1cdots a_nin Pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin P$, for some $iin{1,ldots,n}$; ($m,ngeq 2$). In this paper several results concerning $(n-1,n)$-$Phi_m$-prime and $(n-1,n)$-...
متن کاملFinding Almost Squares
We study short intervals which contain an " almost square " , an integer n that can be factored as n = ab with a, b close to √ n. This is related to the problem on distribution of n 2 α (mod 1) and the problem on gaps between sums of two squares.
متن کاملThree Consecutive Almost Squares
Given a positive integer n, we let sfp(n) denote the squarefree part of n. We determine all positive integers n for which max{sfp(n), sfp(n+ 1), sfp(n+ 2)} ≤ 150 by relating the problem to finding integral points on elliptic curves. We also prove that there are infinitely many n for which max{sfp(n), sfp(n + 1), sfp(n + 2)} < n.
متن کاملAdditive Problems with Prime Variables the Circle Method of Hardy, Ramanujan and Littlewood
In these lectures we give an overview of the circle method introduced by Hardy and Ramanujan at the beginning of the twentieth century, and developed by Hardy, Littlewood and Vinogradov, among others. We also try and explain the main difficulties in proving Goldbach’s conjecture and we give a sketch of the proof of Vinogradov’s three-prime Theorem. 1. ADDITIVE PROBLEMS In the last few centuries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometric and Functional Analysis
سال: 2023
ISSN: ['1420-8970', '1016-443X']
DOI: https://doi.org/10.1007/s00039-023-00635-w